Unusual Prime Number Sequences
نویسندگان
چکیده
منابع مشابه
On a Dynamical Approach to Some Prime Number Sequences
We show how the cross-disciplinary transfer of techniques from dynamical systems theory to number theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo k a...
متن کاملOptimus prime: paraphrasing prime number talk
Baker (Mind 114:223–238, 2005; Brit J Philos Sci 60:611–633, 2009) has recently defended what he calls the “enhanced” version of the indispensability argument for mathematical Platonism. In this paper I demonstrate that the nominalist can respond to Baker’s argument. First, I outline Baker’s argument in more detail before providing a nominalistically acceptable paraphrase of prime-number talk. ...
متن کاملPrime Polynomial Sequences
Let F(x) be a polynomial with integral coefficients of degree d >_ 2 such that F(n) >_ 1 for all it 3 1 . Let OF = {F(n)Í„ , . Then F(tr) is called prime in OF if F(u) is not the product of strictly smaller terms of &F . It is proved that if F(x) is not of the form a(bx+c)d, then almost all terms of (! r are prime in O F. Let 0 = be a sequence of positive integers . Then a,, E & is called compo...
متن کاملBinary Prime Tableau Sequences
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual t...
متن کاملThe Prime Number Graph
Let pn denote the nth prime. The prime number graph is the set of lattice points (n, pn), n = 1, 2.We show that for every k there are k such points that are collinear. By considering the convex hull of the prime number graph, we show that there are infinitely many n such that 2pn < pn_¡ + Pn+Ifor all positive i < n. By a similar argument, we show that there are infinitely many n for which pn > ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1967
ISSN: 0028-0836,1476-4687
DOI: 10.1038/2141164b0